Axiomatizing Qualitative Process Theory

نویسنده

  • Ernest Davis
چکیده

We show that the type of reasoning performed by Forbus' 1985] Qualitative Process (QP) program can be justiied in a rst-order theory that models time and other measure spaces as real-valued quantities. We consider the QP analysis of a can of water with a safety valve being heated over a ame. We exhibit a rst-order theory for the microworld involved in this example, and we prove the correctness of the rst two transitions in the envisionment graph. We discuss the possibility of deriving the closure conditions in the theory via non-monotonic inference. One way to increase conndence in a reasoning program is to show that the conclusions that it draws correspond to valid inferences within some easily intelligible logical theory. Such a correspondence has been shown for many of the best known physical reasoning programs. The calculations performed by QSIM Kuipers, 86] correspond to theorems in real analysis, under a natural interpretation ; Duchier, 91] exhibits full rst-order proofs of these. Likewise the reasoning in NEWTON de Kleer, 77] and ENVISION de Kleer and Brown, 85] can be shown to be valid for a simple physical theory, easily formalized in rst-order logic, in which time and other physical parameters are viewed as real-valued quantities. (See, for example, Rayner, 91], Davis, 90, chap. 7].) However, no adequate logical analysis has hitherto been given for the Qualitative Process (QP) program Forbus, 85]. In QP, processes can come into and out of existence, and the topological structure of the physical system may change over time. Hence, the problem of nding an appropriate formulation of the necessary closed-world assumptions on processes and innuences seemed daunting. In a previous analysis Davis, 90] I was unable to nd a reasonable characterization of these closure principles, and hence left them as intuitively plausible, but wholly unformalized, non-monotonic deductions. In this paper, I show that this gap can be closed. It is possible to characterize inference in QP entirely in terms of a monotonic theory based on real analysis. There are two key points: For each parameter, the theory must give an exhaustive enumeration of the types of processes and parameters that can innuence it. These axioms resemble to the kind of frame axioms advocated by Schubert 1991], which give necessary conditions for a uent to change its value. They are also analogous to the circumscription over causes of change discussed in Lifschitz, 87]. Since QP uses only …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Theory of Sets of Ordinals

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

متن کامل

Practical Step towards Sampling in Qualitative Research; Focused on Grounded Theory

Today, there is a growing trend towards qualitative research in different areas of academic investigations. However, students face difficulties in deciding on qualitative methods of research, because most of the literature on qualitative research focuses on the philosophical and theoretical aspects, and they hardly offer any practical guidelines. This problem is rooted in the essence of qualita...

متن کامل

Provide a Suitable Model to Motivate Teachers for the Education Process

Purpose: This study was conducted to provide an appropriate model to enhance teachers' motivation for the education process. Method: The research method was applied in terms of purpose and exploratory in terms of method. In the qualitative stage, the grounded theory and content analysis method was used and in the quantitative stage, the survey method was used. The qualitative part of the resea...

متن کامل

Axiomatizing St Bisimulation for a Process Algebra with Recursion and Action Reenement (extended Abstract)

Due to the complex nature of bisimulation equivalences which express some form of history dependence, it turned out to be problematic to axiomatize them for non trivial classes of systems. Here we introduce the idea of \compositional level-wise renaming" which gives rise to the new possibility of axiomatizing the class of history dependent bisimulations with slight modiications to the machinery...

متن کامل

Axiomatizing truth in a finite model

Given a finite model, we build an axiomatic theory such that the propositions provable in this theory are those valid in the model. We sketch applications to automated theorem proving.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992